0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.15/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n006.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 15:28:25 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.37	% Python version: Python 3.6.8
0.15/0.37	# Version: 2.6rc1-ho
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 59 seconds
0.36/0.56	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.36/0.56	# and selection function SelectComplexExceptUniqMaxHorn.
0.36/0.56	#
0.36/0.56	# Preprocessing time       : 0.068 s
0.36/0.56	# Presaturation interreduction done
0.36/0.56	
0.36/0.56	# Proof found!
0.36/0.56	# SZS status Theorem
0.36/0.56	# SZS output start CNFRefutation
0.36/0.56	thf(conj_0, conjecture, (((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)<=ord_less_nat @ n @ (size_size_list_a @ xs))&(~(ord_less_nat @ n @ (size_size_list_a @ xs))=>(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.36/0.56	thf(fact_33_i__append__i__drop__eq1, axiom, ![X2:nat, X4:list_a, X95:nat > a]:((listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X4 @ X95))=(listIn1312259492pend_a @ (drop_a @ X2 @ X4) @ X95)<=ord_less_eq_nat @ X2 @ (size_size_list_a @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_33_i__append__i__drop__eq1)).
0.36/0.56	thf(fact_178_dual__order_Ostrict__iff__order, axiom, (ord_less_nat)=(^[X29:nat, X30:nat]:(ord_less_eq_nat @ X29 @ X30&(X30)!=(X29))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_178_dual__order_Ostrict__iff__order)).
0.36/0.56	thf(fact_187_not__le__imp__less, axiom, ![X11:nat, X10:nat]:(~(ord_less_eq_nat @ X11 @ X10)=>ord_less_nat @ X10 @ X11), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_187_not__le__imp__less)).
0.36/0.56	thf(fact_35_i__append__i__drop__eq2, axiom, ![X4:list_a, X2:nat, X64:nat > a]:((listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X4 @ X64))=(listIn1417627087drop_a @ (minus_minus_nat @ X2 @ (size_size_list_a @ X4)) @ X64)<=ord_less_eq_nat @ (size_size_list_a @ X4) @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_35_i__append__i__drop__eq2)).
0.36/0.56	thf(c_0_5, negated_conjecture, ~(((ord_less_nat @ n @ (size_size_list_a @ xs)=>(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))&(~ord_less_nat @ n @ (size_size_list_a @ xs)=>(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.36/0.56	thf(c_0_6, plain, ![X2:nat, X4:list_a, X95:nat > a]:(ord_less_eq_nat @ X2 @ (size_size_list_a @ X4)=>(listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X4 @ X95))=(listIn1312259492pend_a @ (drop_a @ X2 @ X4) @ X95)), inference(fof_simplification,[status(thm)],[fact_33_i__append__i__drop__eq1])).
0.36/0.56	thf(c_0_7, plain, ![X29:nat, X30:nat]:(ord_less_nat @ X29 @ X30<=>(ord_less_eq_nat @ X29 @ X30&(X30)!=(X29))), inference(fof_simplification,[status(thm)],[fact_178_dual__order_Ostrict__iff__order])).
0.36/0.56	thf(c_0_8, negated_conjecture, (((~ord_less_nat @ n @ (size_size_list_a @ xs)|ord_less_nat @ n @ (size_size_list_a @ xs))&((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)|ord_less_nat @ n @ (size_size_list_a @ xs)))&((~ord_less_nat @ n @ (size_size_list_a @ xs)|(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))&((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)|(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.36/0.56	thf(c_0_9, plain, ![X1222:nat, X1223:list_a, X1224:nat > a]:(~ord_less_eq_nat @ X1222 @ (size_size_list_a @ X1223)|(listIn1417627087drop_a @ X1222 @ (listIn1312259492pend_a @ X1223 @ X1224))=(listIn1312259492pend_a @ (drop_a @ X1222 @ X1223) @ X1224)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.36/0.56	thf(c_0_10, plain, ![X932:nat, X933:nat]:(((ord_less_eq_nat @ X932 @ X933|~ord_less_nat @ X932 @ X933)&((X933)!=(X932)|~ord_less_nat @ X932 @ X933))&(~ord_less_eq_nat @ X932 @ X933|(X933)=(X932)|ord_less_nat @ X932 @ X933)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
0.36/0.56	thf(c_0_11, plain, ![X11:nat, X10:nat]:(~ord_less_eq_nat @ X11 @ X10=>ord_less_nat @ X10 @ X11), inference(fof_simplification,[status(thm)],[fact_187_not__le__imp__less])).
0.36/0.56	thf(c_0_12, plain, ![X4:list_a, X2:nat, X64:nat > a]:(ord_less_eq_nat @ (size_size_list_a @ X4) @ X2=>(listIn1417627087drop_a @ X2 @ (listIn1312259492pend_a @ X4 @ X64))=(listIn1417627087drop_a @ (minus_minus_nat @ X2 @ (size_size_list_a @ X4)) @ X64)), inference(fof_simplification,[status(thm)],[fact_35_i__append__i__drop__eq2])).
0.36/0.56	thf(c_0_13, negated_conjecture, (~ord_less_nat @ n @ (size_size_list_a @ xs)|(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.36/0.56	thf(c_0_14, plain, ![X9:nat > a, X1:nat, X4:list_a]:((listIn1417627087drop_a @ X1 @ (listIn1312259492pend_a @ X4 @ X9))=(listIn1312259492pend_a @ (drop_a @ X1 @ X4) @ X9)|~ord_less_eq_nat @ X1 @ (size_size_list_a @ X4)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.36/0.56	thf(c_0_15, plain, ![X1:nat, X2:nat]:(ord_less_eq_nat @ X1 @ X2|~ord_less_nat @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_10])).
0.36/0.56	thf(c_0_16, plain, ![X936:nat, X937:nat]:(ord_less_eq_nat @ X936 @ X937|ord_less_nat @ X937 @ X936), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
0.36/0.56	thf(c_0_17, plain, ![X1118:list_a, X1119:nat, X1120:nat > a]:(~ord_less_eq_nat @ (size_size_list_a @ X1118) @ X1119|(listIn1417627087drop_a @ X1119 @ (listIn1312259492pend_a @ X1118 @ X1120))=(listIn1417627087drop_a @ (minus_minus_nat @ X1119 @ (size_size_list_a @ X1118)) @ X1120)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])).
0.36/0.56	thf(c_0_18, negated_conjecture, ~ord_less_nat @ n @ (size_size_list_a @ xs), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
0.36/0.56	thf(c_0_19, plain, ![X2:nat, X1:nat]:(ord_less_eq_nat @ X1 @ X2|ord_less_nat @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_16])).
0.36/0.56	thf(c_0_20, negated_conjecture, (ord_less_nat @ n @ (size_size_list_a @ xs)|(listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.36/0.56	thf(c_0_21, plain, ![X4:list_a, X9:nat > a, X1:nat]:((listIn1417627087drop_a @ X1 @ (listIn1312259492pend_a @ X4 @ X9))=(listIn1417627087drop_a @ (minus_minus_nat @ X1 @ (size_size_list_a @ X4)) @ X9)|~ord_less_eq_nat @ (size_size_list_a @ X4) @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
0.36/0.56	thf(c_0_22, negated_conjecture, ord_less_eq_nat @ (size_size_list_a @ xs) @ n, inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.36/0.56	thf(c_0_23, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])]), c_0_18]), ['proof']).
0.36/0.56	# SZS output end CNFRefutation
0.36/0.56	# Proof object total steps             : 24
0.36/0.56	# Proof object clause steps            : 9
0.36/0.56	# Proof object formula steps           : 15
0.36/0.56	# Proof object conjectures             : 8
0.36/0.56	# Proof object clause conjectures      : 5
0.36/0.56	# Proof object formula conjectures     : 3
0.36/0.56	# Proof object initial clauses used    : 6
0.36/0.56	# Proof object initial formulas used   : 5
0.36/0.56	# Proof object generating inferences   : 3
0.36/0.56	# Proof object simplifying inferences  : 4
0.36/0.56	# Training examples: 0 positive, 0 negative
0.36/0.56	# Parsed axioms                        : 286
0.36/0.56	# Removed by relevancy pruning/SinE    : 0
0.36/0.56	# Initial clauses                      : 664
0.36/0.56	# Removed in clause preprocessing      : 64
0.36/0.56	# Initial clauses in saturation        : 600
0.36/0.56	# Processed clauses                    : 1700
0.36/0.56	# ...of these trivial                  : 38
0.36/0.56	# ...subsumed                          : 670
0.36/0.56	# ...remaining for further processing  : 992
0.36/0.56	# Other redundant clauses eliminated   : 75
0.36/0.56	# Clauses deleted for lack of memory   : 0
0.36/0.56	# Backward-subsumed                    : 0
0.36/0.56	# Backward-rewritten                   : 7
0.36/0.56	# Generated clauses                    : 3931
0.36/0.56	# ...of the previous two non-trivial   : 3536
0.36/0.56	# Contextual simplify-reflections      : 3
0.36/0.56	# Paramodulations                      : 3802
0.36/0.56	# Factorizations                       : 4
0.36/0.56	# NegExts                              : 19
0.36/0.56	# Equation resolutions                 : 97
0.36/0.56	# Propositional unsat checks           : 0
0.36/0.56	#    Propositional check models        : 0
0.36/0.56	#    Propositional check unsatisfiable : 0
0.36/0.56	#    Propositional clauses             : 0
0.36/0.56	#    Propositional clauses after purity: 0
0.36/0.56	#    Propositional unsat core size     : 0
0.36/0.56	#    Propositional preprocessing time  : 0.000
0.36/0.56	#    Propositional encoding time       : 0.000
0.36/0.56	#    Propositional solver time         : 0.000
0.36/0.56	#    Success case prop preproc time    : 0.000
0.36/0.56	#    Success case prop encoding time   : 0.000
0.36/0.56	#    Success case prop solver time     : 0.000
0.36/0.56	# Current number of processed clauses  : 532
0.36/0.56	#    Positive orientable unit clauses  : 85
0.36/0.56	#    Positive unorientable unit clauses: 2
0.36/0.56	#    Negative unit clauses             : 247
0.36/0.56	#    Non-unit-clauses                  : 198
0.36/0.56	# Current number of unprocessed clauses: 2829
0.36/0.56	# ...number of literals in the above   : 6290
0.36/0.56	# Current number of archived formulas  : 0
0.36/0.56	# Current number of archived clauses   : 403
0.36/0.56	# Clause-clause subsumption calls (NU) : 70063
0.36/0.56	# Rec. Clause-clause subsumption calls : 16344
0.36/0.56	# Non-unit clause-clause subsumptions  : 212
0.36/0.56	# Unit Clause-clause subsumption calls : 16952
0.36/0.56	# Rewrite failures with RHS unbound    : 20
0.36/0.56	# BW rewrite match attempts            : 99
0.36/0.56	# BW rewrite match successes           : 12
0.36/0.56	# Condensation attempts                : 0
0.36/0.56	# Condensation successes               : 0
0.36/0.56	# Termbank termtop insertions          : 99961
0.36/0.57	
0.36/0.57	# -------------------------------------------------
0.36/0.57	# User time                : 0.189 s
0.36/0.57	# System time              : 0.009 s
0.36/0.57	# Total time               : 0.198 s
0.36/0.57	# Maximum resident set size: 2104 pages
0.36/0.57	EOF